三维地震勘探低速带静校正系统的研制

本文在研究目前三维地震勘探中常用的低速带静校正算法的基础上，根据几年来低速带静校正处理情况，研制出一种计算三维地震勘探低速带的静校正系统，简述了这种处理系统的原理，并对吉林油田某三维地震工区的低速带资料进行了处理。结果表明，该系统计算速度快、精度高、实用性强，对改善地震剖面质量和提高信噪比是有效的。     

带类型λ—演算

一、引言补演算是一个用函数描述计算的形式理论体系[1J,它由许多计算模型所组成。文〔1〕指出,应用认-演算比纯粹补演算更接近程序语言.但是由于内建函子和常数的引入常会发生一些问题,例如.常数O和函子+在机器中同样看待     

静态球对称时空中的标量场辐射

采用多项式函数代替乌龟坐标的方法,给出静态球对称时空中黑洞事件视界和宇宙视界区域内标量场方程的解,并对事件视界附近势垒的性质进行了讨论。发现对带电量不同的时空,标量场辐射的形式亦有所不同;势垒随宇宙学常数的减小而变窄、变高。     

Crushing behaviour of the energy absorbing 'tensor skin' panels

ABSTRACT Research results concerning the simulation of the crushing behaviour of composite systems with energy absorption characteristics are presented in the present work. The study is focused on the ‘tensor skin’ concept, an energy absorbing composite system that was originally developed to improve the crashworthiness of helicopters under water impact and which is promising for utilization in the construction of the lower part of composite fuselage aircraft. The ‘tensor skin’ concept comprises a folded or corrugated composite construction, which upon loading unfolds by forming ‘plastic hinges’, leading to an increase in the load bearing capability of the structure. The numerical modelling issues and the critical aspects of the simulation are discussed. Verification of the numerical simulation procedure is performed by experimental work. The experimental results utilized to assess and validate the numerical procedure were derived within the European Research Project ‘Design for Crash Survivability – CRASURV’ (BRITE – Aeronautics Area). The results of the simulations are generally in good agreement with experimental data.     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

A process oriented semantics of the PRAM-language FORK

The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.

In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model.     

结构陶瓷的高温疲劳强度衰减理论

提出了陶瓷材料疲劳强度衰减理论并由此导出了各种疲劳关系式。建立了疲劳基本方程ｄσ＿ｒ／ｄ＿ｉ＝一Ａσ（ｔ）￣ｎｔ￣（－ｍ），得出了疲劳寿命公式Ｔ＝Ｍ（σ＿０－σ）／Ａσ￣ｎ（静疲劳时Ｍ＝１，连续增载疲劳时Ｍ＝ｎ＋１，循环疲劳时Ｍ＝（ｎ＋１）／（１＋Ｒ＋Ｒ￣２＋……＋Ｒ￣ｎ），逐级加载时，并导出不同疲劳方式下疲劳寿命间的关系。同时，用多种Ｓｉ＿３Ｎ＿４材料在高温中作了论证试验，结果与理论一致。     

转炉炼钢静态模型的初步探讨

根据转炉炼钢的物理化学反应机理，从质量平衡和能量平衡的计算出发，通过小参数变动，导出了增量式静态模型中矿石方程和供氧方程的系数。所得结论与新日铁资料基本相符。同时，还进行了炉料和产物的计算，分析了改变废钢比对生产的影响。     

高混凝土面板堆石坝设计与施工理念

坝高233m的水布垭面板堆石坝是目前已建的世界上最高的面板堆石坝,为有效解决工程中的若干技术难题,提高大坝的安全性和经济性,设计和施工中应用了很多新理念、新技术、新材料和新工艺,对此进行概括介绍,为高混凝土面板堆石坝这种坝型在设计、施工及安全监测等技术的进一步发展提供了有益的参考和借鉴。